Varieties of Concurrency Control in IMS/VS Fast Path
نویسندگان
چکیده
Fast Path supports a variety of methods of concurrency control for a vanety 0/ different uses of data. This arose naturally out of efforts to meet the typical ner~ds of large on-line transaction processing businesses. The elements of "optimistic loeking" apply to one type of data, and "group commit" appLies to all types of data. Fast Path development ex.perience supports the idea that the use of a variety of methods of concurrency control by a single transaction is reasonable and is not as difficult as might be expected, at least when there is fast access to shared memory. * This article is intended to be published in the June 1985 issue of the IEEE bulletin on Da.ta.base Engeneering.
منابع مشابه
The Performance of Concurrency Control and Recovery Algorithms for Transaction-Oriented Database Systems
Fast Path supports a variety of methods of concurrency control for a variety of different uses of data. This arose naturally out of efforts to meet the typical needs of large on-line transaction processing businesses. The elements of “optimistic locking” apply to one type of data, and “group commit” applies to all types of data. Fast Path development experience supports the idea that the use of...
متن کاملA Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملA Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملThe Design of XPRS
This paper presents an overview of the techniques we are using to build a DBMS at Berkeley that will simultaneously provide high performance and high availability in transaction processing environments, in applications with complex ad-hoc queries and in applications with large objects such as images or CAD layouts. We plan to achieve these goals using a general purpose DBMS and operating system...
متن کاملAmalgamated Lock-Elision
Hardware lock-elision (HLE) introduces concurrency into legacy lockbased code by optimistically executing critical sections in a fast-path as hardware transactions. Its main limitation is that in case of repeated aborts, it reverts to a fallback-path that acquires a serial lock. This fallback-path lacks hardwaresoftware concurrency, because all fast-path hardware transactions abort and wait for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Database Eng. Bull.
دوره 8 شماره
صفحات -
تاریخ انتشار 1985